Testing Hennessy-Milner Logic with Recursion

نویسندگان

  • Luca Aceto
  • Anna Ingólfsdóttir
چکیده

This study o ers a characterization of the collection of properties expressible in Hennessy-Milner Logic (HML) with recursion that can be tested using nite LTSs. In addition to actions used to probe the behaviour of the tested system, the LTSs that we use as tests will be able to perform a distinguished action nok to signal their dissatisfaction during the interaction with the tested process. A process s passes the test T i T does not perform the action nok when it interacts with s. A test T tests for a property φ in HML with recursion i it is passed by exactly the states that satisfy φ. The paper gives an expressive completeness result o ering a characterization of the collection of properties in HML with recursion that are testable in the above sense.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Process Behaviour: Formulae vs. Tests (Extended Abstract)

Process behaviour is often defined either in terms of the tests they satisfy, or in terms of the logical properties they enjoy. Here we compare these two approaches, using extensional testing in the style of DeNicola, Hennessy, and a recursive version of the property logic HML. We first characterise subsets of this property logic which can be captured by tests. Then we show that those subsets o...

متن کامل

Characteristic Formulae: From Automata to Logic

This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language. It is shown how to characterize logically (states of) finite labelled transition systems modulo bisimilarity using a single formula in Hennessy-Milner logic with recursion. Moreover, characteristic formulae for timed automat...

متن کامل

On Verifying Hennessy-Milner Logic with Recursion at Runtime

We study μHML (a branching-time logic with least and greatest fixpoints) from a runtime verification perspective. We establish which subset of the logic can be verified at runtime and define correct monitor-synthesis algorithms for this subset. We also prove completeness results wrt. these logical subsets that show that no other properties apart from those identified can be verified at runtime.

متن کامل

Formal Methods in System Design Monitorability for the Hennessy-Milner Logic with Recursion

We study muHML, a branching-time logic with least and greatest fix-points, from a runtime verification perspective. The logic may be used to specify properties of programs whose behaviour may be expressed as a labelled transition system. We establish which subset of this logic can be monitored for at runtime by merely observing the runtime execution of a program. We define a monitorsynthesis al...

متن کامل

Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)

We introduce a new type system for the blue calculus { a variant of the-calculus that directly contains the-calculus. Our notion of type is built upon a combination of Curry-Church simple types and Hennessy-Milner logic with recursion. We interpret a modality hui as the type of a process ooering a resource of type on the name u. In the typing system this is used in a kind of logical cut rule, e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999